Improved Apriori Algorithm using logarithmic decoding and pruning

نویسنده

  • Suhani Nagpal
چکیده

In computer science and data mining, Apriori is a classic algorithm for learning association rules. Apriori is designed to operate on databases containing transactions. The purpose of the Apriori Algorithm is to find associations between different sets of data. It is sometimes referred to as "Market Basket Analysis". The aim of this research is to improve the performance of the conventional Apriori algorithm that mines the association rules. The approach is to attain the desired improvement is to create a more efficient new algorithm out of the conventional one by adding the encoding and decoding mechanisms to the latter in order to demonstrate the importance of the efficient decoding to high data mining performance and from various experiments it is proved that the logarithmic decoding method is the most efficient among the all methods it can speed up all the required processes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving Efficiency of Apriori Algorithm Using Transaction Reduction

Association rules are the main technique to determine the frequent itemset in data mining. Apriori algorithm is a classical algorithm of association rule mining. This classical algorithm is inefficient due to so many scans of database. And if the database is large, it takes too much time to scan the database. In this paper, we proposed an Improved Apriori algorithm which reduces the scanning ti...

متن کامل

The Relation of Closed Itemset Mining, Complete Pruning Strategies and Item Ordering in Apriori-Based FIM Algorithms

In this paper we investigate the relationship between closed itemset mining, the complete pruning technique and item ordering in the Apriori algorithm. We claim, that when proper item order is used, complete pruning does not necessarily speed up Apriori, and in databases with certain characteristics, pruning increases run time significantly. We also show that if complete pruning is applied, the...

متن کامل

Performance optimization of MapRe duce-base d Apriori algorithm on Hadoop cluster

Many techniques have been proposed to implement the Apriori algorithm on MapReduce framework but only a few have focused on performance improvement. FPC (Fixed Passes Combined-counting) and DPC (Dynamic Passes Combined-counting) algorithms combine multiple passes of Apriori in a single MapReduce phase to reduce the execution time. In this paper, we propose improved MapReduce based Apriori algor...

متن کامل

Association Rule Mining based on Apriori Algorithm in Minimizing Candidate Generation

Association Rule Mining is an area of data mining that focuses on pruning candidate keys. An Apriori algorithm is the most commonly used Association Rule Mining. This algorithm somehow has limitation and thus, giving the opportunity to do this research. This paper introduces a new way in which the Apriori algorithm can be improved. The modified algorithm introduces factors such as set size and ...

متن کامل

An Efficient Modified Apriori Algorithm for Mining Association Rules for Large Itemsets in Large Centralized Databases

The proposed algorithm is derived from the conventional Apriori approach with features added to improve data mining performance. These features are embedded in the encoding and decoding mechanisms. It has been confirmed by the experiment results that these features can indeed support effective and efficient mining of association rules in large centralized databases. The goal of the encoding mec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012